AES Candidates: A Survey of Implementations
نویسنده
چکیده
We present a cross-table of almost all publicly known implementations of AES candidates, including the ones done by the authors. A short overview of our own implementations of Rijndael is given. The relative easiness of doing “the world best” implementations and a lot of gaps in the table force us to ask if there is enough information known to really decide which ciphers are fast and which are not. (This paper only compares the encryption speed in the case of the 128-bit keys.) In the conclusions we present a very brief survey of the known attacks to the candidates, stressing the fact that other aspects of the candidates are still less known (at least to the public). We finish this paper with apparent conclusions that the first round of the AES process has been too short, but we still give recommendations which candidates should be elected to the second round basing on the knowledge known to the public at the moment of writing this paper.
منابع مشابه
FPGA and ASIC Implementations of AES
In 1997, an effort was initiated to develop a new American encryption standard to be commonly used well into the next century. This new standard was given a name AES, Advanced Encryption Standard. A new algorithm was selected through a contest organized by the National Institute of Standards and Technology (NIST). By June 1998, 15 candidate algorithms had been submitted to NIST by research grou...
متن کاملA Comparative Study of Performance of AES Final Candidates Using FPGAs
In this paper we study and compare the performance of FPGA-based implementations of the ve nal AES candidates (MARS, RC6, Rijndael, Serpent, and Two sh). FPGAs seem to match extremely well with the operations required by the nal candidates. Among the various time-space implementation tradeo s, we focused primarily on time performance. The time performance metrics are throughput and latency. Thr...
متن کاملSharing Resources Between AES and the SHA-3 Second Round Candidates Fugue and Grøstl
Four out of the 14 second round candidates of the NIST SHA-3 cryptographic hash algo rithm competition are so-called AES-inspired algorithms which share common structure and features with AES or even use it as a subroutine. This paper focuses on two of them, Fugue and Grøstl, and studies how efficiently logic can be shared in implementations combining them with AES. It will be shown that addin...
متن کاملA Cautionary Note Regarding Evaluation of AES Candidates on Smart-Cards
NIST has considered the performance of AES candidates on smart-cards as an important selection criterion and many submitters have highlighted the compactness and e ciency of their submission on low end smart cards. However, in light of recently discovered power based attacks, we strongly argue that evaluating smart-card suitability of AES candidates requires a very cautious approach. We demonst...
متن کاملA Cautionary Note Regarding Evaluation of AES Candidateson
NIST has considered the performance of AES candidates on smart-cards as an important selection criterion and many submitters have highlighted the compactness and eeciency of their submission on low end smart cards. However, in light of recently discovered power based attacks, we strongly argue that evaluating smart-card suitability of AES candidates requires a very cautious approach. We demonst...
متن کامل